Models and termination of proof-reduction in the $λ$$Π$-calculus modulo theory
نویسنده
چکیده
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then use this notion to define a notion of super-consistent theory and to prove that proof reduction terminates in the λΠ-calculus modulo a super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.
منابع مشابه
Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the λΠ-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملThe Subject Reduction Property in the λΠ-calculus modulo
In type theory, the subject reduction (or type preservation) property states that the type of a λ-term is preserved under reduction. This article studies this property in the context of the λΠ-calculus modulo, a variant of the λ-calculus with dependent types (λΠ-calculus) where β-reduction is extended with user-defined object-level and type-level rewrite rules. We show that it is equivalent to ...
متن کاملEvaluating functions as processes
A famous result by Milner is that the λ -calculus can be simulated inside the π-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between β -reduction and how it is simulated in the π-calculus. The idea is that evaluating a λ -term in the π-calculus is like running an environment-based abstract machine, rather than applying o...
متن کاملTermination of rewrite relations on λ-terms based on Girard's notion of reducibility
In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination of various kinds of rewrite relations on λ-terms, including rewriting modulo some equational theory and rewriting with matching modulo βη, by using the notion of computability closure. This provides a powerful ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.06522 شماره
صفحات -
تاریخ انتشار 2014